Homogeneous Buchberger algorithms and Sullivant’s computational commutative algebra challenge
نویسنده
چکیده
We give a variant of the homogeneous Buchberger algorithm for positively graded lattice ideals. Using this algorithm we solve the Sullivant computational commutative algebra challenge1 .
منابع مشابه
Extended letterplace correspondence for nongraded noncommutative ideals and related algorithms
The notion of “letterplace correspondence” introduced in [18, 19] is generalized in this paper to the case of nongraded (two-sided) ideals of the free associative algebra K〈xi〉 generated by a finite or countable number of variables xi. For such purpose we develop the notion of saturation for the graded ideals of K〈xi, t〉, where t is an extra variable and for their letterplace analogues in the c...
متن کاملXIDEAL Gröbner Bases for Exterior Algebra
The method of Gröbner bases in commutative polynomial rings introduced by Buchberger (e.g. [1]) is a well-known and very important tool in polynomial ideal theory, for example in solving the ideal membership problem. XIDEAL extends the method to exterior algebras using algorithms from [2] and [3]. There are two main departures from the commutative polynomial case. First, owing to the non-commut...
متن کاملXideal Grr Obner Bases for Exterior Algebra
1 Description The method of Grr obner bases in commutative polynomial rings introduced by Buchberger (e.g. 1]) is a well-known and very important tool in polynomial ideal theory, for example in solving the ideal membership problem. XIDEAL extends the method to exterior algebras using algorithms from 2]. There are two main departures from the commutative polynomial case. First, owing to the non-...
متن کاملGröbner Bases: An Introduction
The method (theory plus algorithms) of Gröbner bases provides a uniform approach to solving a wide range of problems expressed in terms of sets of multivariate polynomials. x y 2y z z 0 y 2 x 2 z x z 0 z 2 y 2 x x 0 Example: kinematic equations of a robot. algebraic geometry, commutative algebra, polynomial ideal theory invariant theory automated geometrical theorem proving Groebner-Bases.nb 1
متن کاملOn Monic Gröbner Bases in Free Algebras over Rings Stemming from Bergman’s Diamond Lemma
Let R be an arbitrary commutative ring and R〈X〉 = R〈X1, ..., Xn〉 the free algebra of n generators over R. Note that Bergman’s diamond lemma characterizes the resolvability of ambiguities of monic relations of the form Wσ − fσ with fσ a linear combination of monomials ≺ Wσ, where ≺ is a semigroup partial ordering on 〈X〉; and that in the algorithmic language of Gröbner basis theory over a ground ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008